Query Optimization on Compressed and Decompressed Object-Oriented Database Using Operators

In this paper, we present an approach using various database operators that permits to enrich technique of query optimization existing in the objectoriented databases and the comparative analysis of query optimization of compressed and uncompressed object oriented database based on cost, cardinality and no of bytes. Focus is on query optimization using relational operator, logical operator and special operators. Our experimental study shows that the improvement in the quality of plans is significant only with decrease in cost, cardinality and no of bytes after database compression. Looking at the success of query optimization in the relational model, our approach inspires itself of these optimization techniques and enriched it so that they can support the new concepts introduced by the object oriented databases.